Linear filtering methods for fixed rate quantisation with noisy symmetric error channels
نویسندگان
چکیده
This study considers linear filtering methods for minimising the end-to-end average distortion of a fixed-rate source quantisation system. For the source encoder, both scalar and vector quantisation are considered. The codebook index output by the encoder is sent over a noisy discrete memoryless channel whose statistics could be unknown at the transmitter. At the receiver, the code vector corresponding to the received index is passed through a linear receive filter, whose output is an estimate of the source instantiation. Under this setup, an approximate expression for the average weighted mean-square error (WMSE) between the source instantiation and the reconstructed vector at the receiver is derived using high-resolution quantisation theory. Also, a closed-form expression for the linear receive filter that minimises the approximate average WMSE is derived. The generality of framework developed is further demonstrated by theoretically analysing the performance of other adaptation techniques that can be employed when the channel statistics are available at the transmitter also, such as joint transmit–receive linear filtering and codebook scaling. Monte Carlo simulation results validate the theoretical expressions, and illustrate the improvement in the average distortion that can be obtained using linear filtering techniques.
منابع مشابه
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless feedback is allowed from the decoder to the encoder. To beat the bound, the problem must be changed. While it has long been known that variable-length block codes can do better when trading-off error probability with e...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملAn Improved Vector Quantisation Algorithm for Speech Transmission Over Noisy Channels
Vector quantisation (VQ) is a method widely used in low bit-rate coding and transmission of speech signals. Unfortunately, a single bit error in the transmitted index, due to noise in the transmission channel, could degrade perceived speech quality at the receiver quite dramatically, as the reference vector retrieved by the corrupted index may di er greatly from the vector corresponding to the ...
متن کاملComprehensive Analysis on Exact Asymptotics of Random Coding Error Probability
This paper considers error probabilities of random codes for memoryless channels in the fixed-rate regime. Random coding is a fundamental scheme to achieve the channel capacity and many studies have been conducted for the asymptotics of the decoding error probability. Gallager derived the exact asymptotics (that is, a bound with asymptotically vanishing relative error) of the error probability ...
متن کاملCommunication-Limited Stabilisability of Jump Markov Linear Systems
This paper investigates the control of fully observed, scalar jump Markov linear systems in which feedback is transmitted at finite data rates over noiseless digital channels. In particular, the objective is to find the infimum data rate, over all causal coding and control laws, at which such a system may be asymptotically stabilised in mth absolute output moment. The control problem is first s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013